Notes on Combinatorial Optimization

Lecture notes on random graphs and probabilistic combinatorial optimization

Combinatorial Optimisation Notes to accompany lectures in Combinatorial Optimisation Hilary Term 2007

Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications

Make more knowledge even in less time every day. You may not always spend your time and money to go abroad and get the experience and knowledge by yourself. Reading is a good alternative to do in getting this desirable knowledge and experience. You may gain many things from experiencing directly, but of course it will spend much money. So here, by reading efficient approximation and online algo...

Multiobjective Optimization in a Quantum Adiabatic Computer

In this work we present a quantum algorithm for multiobjective combinatorial optimization. We show that the adiabatic algorithm of Farhi et al. [arXiv:quant-ph/0001106] can be used by mapping a multiobjective combinatorial optimization problem onto a Hamiltonian using a convex combination among objectives. We present mathematical properties of the eigenspectrum of the associated Hamiltonian and...

The combinatorial stages of chromatic scheduling polytopes

Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks. This problem is NP-hard, and admits no polynomial time algorithms with a fixed approximation ratio. As algorithms based on cutting planes have shown to be successful for many other combinatorial optimization problems, the goal is to apply such methods to the bandwidth allo...